Selfish routing in public services

Equilibria in Dynamic Selfish Routing

In both transportation and communication networks we are faced with “selfish flows”, where every agent sending flow over the network desires to get it to its destination as soon as possible. Such flows have been well studied in time-invariant networks in the last few years. A key observation that must be taken into account in defining and studying selfish flow, however, is that a flow can take ...

Dynamic selfish routing

This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the Wardrop model, which forms the basis of our dynamic population model, each of an infinite number of agents injects an infinitesimal amount of flow into a network, which in turn induces latency on the edges. Each agent may choose from a set of paths and strives to minimise its sustained latency se...

Selfish Routing A

Selfish Routing in Social Networks

I investigate the intersection of selfish routing and the preferential attachment social network. In particular, through the use of a stochastic generative preferential attachment model, a collection abstract network patterns are created for the transfer of flow from one distinct source destination vertex pair. Then, using a linear approximation method, I calculate both Nash and system optimal ...

SELFISH ROUTING A Dissertation